A Multiobjective Frontier Search Algorithm
نویسندگان
چکیده
The paper analyzes the extension of frontier search to the multiobjective framework. A frontier multiobjective A* search algorithm is developed, some formal properties are presented, and its performance is compared to those of other multiobjective search algorithms. The new algorithm is adequate for both monotone and non-monotone heuristics.
منابع مشابه
SSPMO: A Scatter Search Procedure for Non-Linear Multiobjective Optimization
We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of ...
متن کاملEvolutionary Multiobjective Optimization Using a Fuzzy-based Dominance Concept
One aspect that is often disregarded in evolutionary multiobjective research is the fact that the solution of a problem involves not only search but decision making. Most of approaches concentrate on adapting an evolutionary algorithm to generate the Pareto frontier. In this work we present a new idea to incorporate preferences in MOEA. We introduce a binary fuzzy preference relation that expre...
متن کاملGradient projection and local region search for multiobjective optimisation
This paper presents a new method for multiobjective optimisation based on gradient projection and local region search. The gradient projection is conducted through the identi®cation of normal vectors of an ecient frontier. The projection of the gradient of a nonlinear utility function onto the tangent plane of the ecient frontier at a given ef®cient solution leads to the de®nition of a feasib...
متن کاملMultiobjective programming using uniform design and genetic algorithm
The notion of Pareto-optimality is one of the major approaches to multiobjective programming. While it is desirable to find more Pareto-optimal solutions, it is also desirable to find the ones scattered uniformly over the Pareto frontier in order to provide a variety of compromise solutions to the decision maker. In this paper, we design a genetic algorithm for this purpose. We compose multiple...
متن کاملTabu Search for Multiobjective Optimization: MOTS
This paper presents the multiobjective tabu search method, MOTS. Being an adaptation of the well known tabu search, it is used heuristically to generate non-dominated alternatives to multiobjective combinatorial optimization problems. MOTS works with a set of current solutions which, through manipulation of weights, are optimized towards the nondominated frontier while at the same time seek to ...
متن کامل